Finding all common bases in two matroids
نویسندگان
چکیده
منابع مشابه
On Disjoint Common Bases in Two Matroids
We prove two results on packing common bases of two matroids. First, we show that the computational problem of common base packing reduces to the special case where one of the matroids is a partition matroid. Second, we give a counterexample to a conjecture of Chow, which proposed a sufficient condition for the existence of a common base packing. Chow’s conjecture is a generalization of Rota’s ...
متن کاملFinding Common Weights in Two-Stage Network DEA
In data envelopment analysis (DEA), mul-tiplier and envelopment CCR models eval-uate the decision-making units (DMUs) under optimal conditions. Therefore, the best prices are allocated to the inputs and outputs. Thus, if a given DMU was not efficient under optimal conditions, it would not be considered efficient by any other models. In the current study, using common weights in DEA, a number of...
متن کاملBases in Infinite Matroids
We consider bases in matroids of infinite rank, and prove: (a) the existence of a perfect matching in the 'transition graph' of any two bases. This is an extension of the existence of a non-zero generalized diagonal in the transition matrix between bases in finite dimensional linear spaces, and settles a conjecture of the second author [8]. (b) A Cantor-Bernstein theorem for matroids. (c) The e...
متن کاملBASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کاملEquicovering matroids by distinct bases
We ask, and answer, the following question: when is it possible to cover the elements of a given matroid M by p distinct bases so that each element is covered exactly k times? Our result is weaker than the Cyclic Order Conjecture of Wiedemann [9] (and of Kajitani, Ueno and Miyano [7]), but stronger than similar previous results; it could represent a first step towards resolving the conjecture.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00088-u